package bTree.LeetCode;

public class 最小路径和 {
    public int minPathSum(int[][] grid) {
        int row=grid.length;
        int line=grid[0].length;
        int [][]dp=new int[row][line];
        dp[0][0]=grid[0][0];
        for (int i = 1; i < line; i++) {
            dp[0][i]=dp[0][i-1]+grid[0][i];
        }
        for (int i = 1; i < row; i++) {
            dp[i][0]=dp[i-1][0]+grid[i][0];
        }
        for (int i=1;i<row;i++){
            for (int j=1;j<line;j++){
                dp[i][j]=Math.min(dp[i-1][j],dp[i][j-1])+grid[i][j];
            }
        }
        return dp[row-1][line-1];
    }
}